Exceptional points of two-dimensional random walks at multiples of the cover time
نویسندگان
چکیده
We study exceptional sets of the local time continuous-time simple random walk in scaled-up (by N) versions $$D_N\subseteq {\mathbb {Z}}^2$$ bounded open domains $$D\subseteq {R}}^2$$ . Upon exit from $$D_N$$ , lands on a “boundary vertex” and then reenters through boundary edge next step. In parametrization by at we prove that, times corresponding to $$\theta $$ -multiple cover suitably defined $$\lambda -thick (i.e., heavily visited) -thin lightly points are, as $$N\rightarrow \infty distributed according Liouville Quantum Gravity $$Z^D_\lambda with parameter -times critical value. For <1$$ also set avoided vertices (a.k.a. late points) where is order unity are $$Z^D_{\sqrt{\theta }}$$ The structure described well, that pinned Discrete Gaussian Free Field for thick thin random-interlacement occupation-time field points. results demonstrate universality these extremal problems.
منابع مشابه
The Cover Time of Deterministic Random Walks
The rotor router model is a popular deterministic analogue of a random walk on a graph. Instead of moving to a random neighbor, the neighbors are served in a fixed order. We examine how fast this “deterministic random walk” covers all vertices (or all edges). We present general techniques to derive upper bounds for the vertex and edge cover time and derive matching lower bounds for several impo...
متن کاملMicroleakage of Bulk-Fill Composites at Two Different Time Points
Objectives: Microleakage is the main concern in composite restorations. This study aimed to compare the microleakage of two bulk-fill and one conventional composite at two different time points. Methods: Class II cavities were prepared in 60 premolar teeth and divided into six groups of 20. Groups 1 and 4 were incrementally filled with Grandio composite. Groups 2 and 5 were filled with X-tra...
متن کاملCollision Problems of Random Walks in Two-Dimensional Time*
Let (Xij: i > 0, i > 0} be a double sequence of independently, identically distributed random variables (i.i.d.) which takes values in the d-dimensional integer lattice Ed . The double sequence {Sm,,: m > 0, n > 0} defined by Sllan= xy=, zyW, Xgj is called the random walk in two-dimensional time generated by 41, or a two-parameter random walk, or simply a random walk when there is no danger of ...
متن کاملTight Bounds for the Cover Time of Multiple Random Walks
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the speed-up defined as the ratio between the cover time of one and the cover time of k random walks. Recently Alon et al. developed several bounds that are based on the quotient between the cover time and maximum hittin...
متن کاملOn the Cover Time of Random Walks on Graphs
This article deals with random walks on arbitrary graphs. We consider the cover time of finite graphs. That is, we study the expected time needed for a random walk on a finite graph to visit every vertex at least once. We establish an upper bound of O(n 2) for the expectation of the cover time for regular (or nearly regular) graphs. We prove a lower bound of s log n) for the expected cover time...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Probability Theory and Related Fields
سال: 2022
ISSN: ['0178-8051', '1432-2064']
DOI: https://doi.org/10.1007/s00440-022-01113-4